/*
	将两个集合分成两个,两个再分,递归,至少两个元素后,大的在后小的在前
*/

#include <stdio.h>
//#include <merge.h>
#define MAXSIZE 50
typedef int ElemType;

ElemType b[50];

void merge(ElemType c[],ElemType d[] int left, int i, int right)
{
	int p = left, q = i+1, j = left;

	while (p <= i && q <= right)
	{
		if (c[p] <= c[q])
			d[]
	}
}

void mergeSort(ElemType a[],int left, int right)
{
	if (left < right)
	{
		int i = (left + right)/2;//取中点
		mergeSort(a,left,i);
		mergeSort(a,i+1,right);

		//ElemType b[MAXSIZE];

		merge(a,b,left,i,right);
		Copy(a,b,left,right);
	}
}

int main(void)
{
	int a[4] = {2,4,1,3};
	//int b[2] = {1,3};
	mergeSort(a,0,3);

	printf("%d\n",a[0]);
}